A Counterexample to a Conjucture of Lovasz on the Shannon Capcity
نویسنده
چکیده
In general, Shannon zero-capacity is hard to obtain even for very simple small graphs. Lovasz constructed an upper bound in [4] for Shannon capacity which is well-characterized and relatively easy to compute. In some special cases, it is even equal to the Shannon capacity. However, it has been proven that the Lovasz bound is not always tight and counterexamples are not hard to find.
منابع مشابه
Lectures 4 & 5 : Shannon Capacity of a Union of Graphs
In the previous lectures, we have defined the Shannon Capacity of a graph, Θ(G). This lecture is concerned with the Shannon Capacity of the disjoint union G +H of two graphs G and H. The union of two graphs is, informally, what you get when you just place one graph next to the other. In 1956, Shannon conjectured [1] that Θ(G + H) = Θ(G) + Θ(H). As we will see, this is a very natural conjecture ...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملThe gap between monotone and non-monotone circuit complexity is exponential
The lower bound (b) has been improved to a properly exponential function (exp (cn~)) by N. Alon and R. Boppana [1]. It is a conceptual advantage of (a) that the problem considered there is polynomial time solvable and therefore can be computed by a polynomial size nonmonotone Boolean circuit, thus establishing a superpolynomial gap between the monotone and non-monotone circuit complexities of m...
متن کاملA Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملA New Model for Best Customer Segment Selection Using Fuzzy TOPSIS Based on Shannon Entropy
In today’s competitive market, for a business firm to win higher profit among its rivals, it is of necessity to evaluate, and rank its potential customer segments to improve its Customer Relationship Management (CRM). This brings the importance of having more efficient decision making methods considering the current fast growing information era. These decisions usually involve several criteria,...
متن کامل